Termination w.r.t. Q proof of TRS/TRCSREx8_BLR02

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(fib₁(N)) -> SEL₂(N, fib1₂(s₁(0), s₁(0)))
PROPER₁(fib1₂(X1, X2)) -> FIB1₂(proper₁(X1), proper₁(X2))
ACTIVE₁(fib1₂(X1, X2)) -> FIB1₂(X1, active₁(X2))
S₁(mark₁(X)) -> S₁(X)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(fib1₂(X, Y)) -> FIB1₂(Y, add₂(X, Y))
FIB₁(mark₁(X)) -> FIB₁(X)
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
ACTIVE₁(fib₁(N)) -> S₁(0)
FIB1₂(mark₁(X1), X2) -> FIB1₂(X1, X2)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(add₂(X1, X2)) -> ADD₂(active₁(X1), X2)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X2)
ACTIVE₁(fib₁(N)) -> FIB1₂(s₁(0), s₁(0))
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
FIB₁(ok₁(X)) -> FIB₁(X)
SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)
ACTIVE₁(s₁(X)) -> S₁(active₁(X))
ACTIVE₁(fib1₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(add₂(X1, X2)) -> ADD₂(X1, active₁(X2))
FIB1₂(X1, mark₁(X2)) -> FIB1₂(X1, X2)
PROPER₁(s₁(X)) -> PROPER₁(X)
ACTIVE₁(add₂(s₁(X), Y)) -> ADD₂(X, Y)
TOP₁(mark₁(X)) -> PROPER₁(X)
ADD₂(mark₁(X1), X2) -> ADD₂(X1, X2)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X1)
PROPER₁(fib₁(X)) -> PROPER₁(X)
ACTIVE₁(fib₁(X)) -> ACTIVE₁(X)
PROPER₁(sel₂(X1, X2)) -> SEL₂(proper₁(X1), proper₁(X2))
ACTIVE₁(fib1₂(X1, X2)) -> ACTIVE₁(X1)
PROPER₁(add₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> SEL₂(X1, active₁(X2))
PROPER₁(add₂(X1, X2)) -> ADD₂(proper₁(X1), proper₁(X2))
ACTIVE₁(fib1₂(X1, X2)) -> FIB1₂(active₁(X1), X2)
ACTIVE₁(sel₂(s₁(N), cons₂(X, XS))) -> SEL₂(N, XS)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
SEL₂(X1, mark₁(X2)) -> SEL₂(X1, X2)
PROPER₁(s₁(X)) -> S₁(proper₁(X))
S₁(ok₁(X)) -> S₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)
ACTIVE₁(cons₂(X1, X2)) -> CONS₂(active₁(X1), X2)
ADD₂(ok₁(X1), ok₁(X2)) -> ADD₂(X1, X2)
PROPER₁(fib₁(X)) -> FIB₁(proper₁(X))
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(fib₁(X)) -> FIB₁(active₁(X))
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(fib1₂(X, Y)) -> ADD₂(X, Y)
SEL₂(ok₁(X1), ok₁(X2)) -> SEL₂(X1, X2)
ACTIVE₁(fib1₂(X, Y)) -> CONS₂(X, fib1₂(Y, add₂(X, Y)))
FIB1₂(ok₁(X1), ok₁(X2)) -> FIB1₂(X1, X2)
PROPER₁(add₂(X1, X2)) -> PROPER₁(X2)
ADD₂(X1, mark₁(X2)) -> ADD₂(X1, X2)
PROPER₁(cons₂(X1, X2)) -> CONS₂(proper₁(X1), proper₁(X2))
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
ACTIVE₁(sel₂(X1, X2)) -> SEL₂(active₁(X1), X2)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)
ACTIVE₁(add₂(s₁(X), Y)) -> S₁(add₂(X, Y))

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(fib₁(N)) -> SEL₂(N, fib1₂(s₁(0), s₁(0)))
PROPER₁(fib1₂(X1, X2)) -> FIB1₂(proper₁(X1), proper₁(X2))
ACTIVE₁(fib1₂(X1, X2)) -> FIB1₂(X1, active₁(X2))
S₁(mark₁(X)) -> S₁(X)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(fib1₂(X, Y)) -> FIB1₂(Y, add₂(X, Y))
FIB₁(mark₁(X)) -> FIB₁(X)
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
ACTIVE₁(fib₁(N)) -> S₁(0)
FIB1₂(mark₁(X1), X2) -> FIB1₂(X1, X2)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(add₂(X1, X2)) -> ADD₂(active₁(X1), X2)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X2)
ACTIVE₁(fib₁(N)) -> FIB1₂(s₁(0), s₁(0))
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
FIB₁(ok₁(X)) -> FIB₁(X)
SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)
ACTIVE₁(s₁(X)) -> S₁(active₁(X))
ACTIVE₁(fib1₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(add₂(X1, X2)) -> ADD₂(X1, active₁(X2))
FIB1₂(X1, mark₁(X2)) -> FIB1₂(X1, X2)
PROPER₁(s₁(X)) -> PROPER₁(X)
ACTIVE₁(add₂(s₁(X), Y)) -> ADD₂(X, Y)
TOP₁(mark₁(X)) -> PROPER₁(X)
ADD₂(mark₁(X1), X2) -> ADD₂(X1, X2)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X1)
PROPER₁(fib₁(X)) -> PROPER₁(X)
ACTIVE₁(fib₁(X)) -> ACTIVE₁(X)
PROPER₁(sel₂(X1, X2)) -> SEL₂(proper₁(X1), proper₁(X2))
ACTIVE₁(fib1₂(X1, X2)) -> ACTIVE₁(X1)
PROPER₁(add₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> SEL₂(X1, active₁(X2))
PROPER₁(add₂(X1, X2)) -> ADD₂(proper₁(X1), proper₁(X2))
ACTIVE₁(fib1₂(X1, X2)) -> FIB1₂(active₁(X1), X2)
ACTIVE₁(sel₂(s₁(N), cons₂(X, XS))) -> SEL₂(N, XS)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
SEL₂(X1, mark₁(X2)) -> SEL₂(X1, X2)
PROPER₁(s₁(X)) -> S₁(proper₁(X))
S₁(ok₁(X)) -> S₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)
ACTIVE₁(cons₂(X1, X2)) -> CONS₂(active₁(X1), X2)
ADD₂(ok₁(X1), ok₁(X2)) -> ADD₂(X1, X2)
PROPER₁(fib₁(X)) -> FIB₁(proper₁(X))
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(fib₁(X)) -> FIB₁(active₁(X))
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(fib1₂(X, Y)) -> ADD₂(X, Y)
SEL₂(ok₁(X1), ok₁(X2)) -> SEL₂(X1, X2)
ACTIVE₁(fib1₂(X, Y)) -> CONS₂(X, fib1₂(Y, add₂(X, Y)))
FIB1₂(ok₁(X1), ok₁(X2)) -> FIB1₂(X1, X2)
PROPER₁(add₂(X1, X2)) -> PROPER₁(X2)
ADD₂(X1, mark₁(X2)) -> ADD₂(X1, X2)
PROPER₁(cons₂(X1, X2)) -> CONS₂(proper₁(X1), proper₁(X2))
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
ACTIVE₁(sel₂(X1, X2)) -> SEL₂(active₁(X1), X2)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)
ACTIVE₁(add₂(s₁(X), Y)) -> S₁(add₂(X, Y))

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 9 SCCs with 26 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ADD₂(X1, mark₁(X2)) -> ADD₂(X1, X2)
ADD₂(mark₁(X1), X2) -> ADD₂(X1, X2)
ADD₂(ok₁(X1), ok₁(X2)) -> ADD₂(X1, X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ADD₂(X1, mark₁(X2)) -> ADD₂(X1, X2)

The remaining pairs can at least be oriented weakly.

ADD₂(mark₁(X1), X2) -> ADD₂(X1, X2)
ADD₂(ok₁(X1), ok₁(X2)) -> ADD₂(X1, X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ADD₂(x₁, x₂) ) = max{0, x₂ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ADD₂(mark₁(X1), X2) -> ADD₂(X1, X2)
ADD₂(ok₁(X1), ok₁(X2)) -> ADD₂(X1, X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ADD₂(mark₁(X1), X2) -> ADD₂(X1, X2)

The remaining pairs can at least be oriented weakly.

ADD₂(ok₁(X1), ok₁(X2)) -> ADD₂(X1, X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ADD₂(x₁, x₂) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ADD₂(ok₁(X1), ok₁(X2)) -> ADD₂(X1, X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ADD₂(ok₁(X1), ok₁(X2)) -> ADD₂(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ADD₂(x₁, x₂) ) = max{0, x₂ - 2}

POL( ok₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)
CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)

The remaining pairs can at least be oriented weakly.

CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( CONS₂(x₁, x₂) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( CONS₂(x₁, x₂) ) = max{0, x₂ - 2}

POL( ok₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S₁(ok₁(X)) -> S₁(X)
S₁(mark₁(X)) -> S₁(X)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

S₁(ok₁(X)) -> S₁(X)

The remaining pairs can at least be oriented weakly.

S₁(mark₁(X)) -> S₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( S₁(x₁) ) = max{0, x₁ - 2}

POL( ok₁(x₁) ) = x₁ + 3

POL( mark₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S₁(mark₁(X)) -> S₁(X)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

S₁(mark₁(X)) -> S₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( S₁(x₁) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FIB1₂(X1, mark₁(X2)) -> FIB1₂(X1, X2)
FIB1₂(mark₁(X1), X2) -> FIB1₂(X1, X2)
FIB1₂(ok₁(X1), ok₁(X2)) -> FIB1₂(X1, X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FIB1₂(X1, mark₁(X2)) -> FIB1₂(X1, X2)

The remaining pairs can at least be oriented weakly.

FIB1₂(mark₁(X1), X2) -> FIB1₂(X1, X2)
FIB1₂(ok₁(X1), ok₁(X2)) -> FIB1₂(X1, X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( FIB1₂(x₁, x₂) ) = max{0, x₂ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FIB1₂(mark₁(X1), X2) -> FIB1₂(X1, X2)
FIB1₂(ok₁(X1), ok₁(X2)) -> FIB1₂(X1, X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FIB1₂(mark₁(X1), X2) -> FIB1₂(X1, X2)

The remaining pairs can at least be oriented weakly.

FIB1₂(ok₁(X1), ok₁(X2)) -> FIB1₂(X1, X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( FIB1₂(x₁, x₂) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FIB1₂(ok₁(X1), ok₁(X2)) -> FIB1₂(X1, X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FIB1₂(ok₁(X1), ok₁(X2)) -> FIB1₂(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( FIB1₂(x₁, x₂) ) = max{0, x₂ - 2}

POL( ok₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL₂(X1, mark₁(X2)) -> SEL₂(X1, X2)
SEL₂(ok₁(X1), ok₁(X2)) -> SEL₂(X1, X2)
SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SEL₂(X1, mark₁(X2)) -> SEL₂(X1, X2)

The remaining pairs can at least be oriented weakly.

SEL₂(ok₁(X1), ok₁(X2)) -> SEL₂(X1, X2)
SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( SEL₂(x₁, x₂) ) = max{0, x₂ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL₂(ok₁(X1), ok₁(X2)) -> SEL₂(X1, X2)
SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SEL₂(ok₁(X1), ok₁(X2)) -> SEL₂(X1, X2)

The remaining pairs can at least be oriented weakly.

SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( SEL₂(x₁, x₂) ) = max{0, x₂ - 2}

POL( ok₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( SEL₂(x₁, x₂) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FIB₁(mark₁(X)) -> FIB₁(X)
FIB₁(ok₁(X)) -> FIB₁(X)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FIB₁(mark₁(X)) -> FIB₁(X)

The remaining pairs can at least be oriented weakly.

FIB₁(ok₁(X)) -> FIB₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( FIB₁(x₁) ) = max{0, x₁ - 2}

POL( mark₁(x₁) ) = x₁ + 3

POL( ok₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FIB₁(ok₁(X)) -> FIB₁(X)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FIB₁(ok₁(X)) -> FIB₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( FIB₁(x₁) ) = max{0, x₁ - 2}

POL( ok₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(add₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib₁(X)) -> PROPER₁(X)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(add₂(X1, X2)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(add₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(add₂(X1, X2)) -> PROPER₁(X2)

The remaining pairs can at least be oriented weakly.

PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib₁(X)) -> PROPER₁(X)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( add₂(x₁, x₂) ) = x₁ + x₂ + 3

POL( s₁(x₁) ) = x₁

POL( cons₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( fib1₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( fib₁(x₁) ) = x₁

POL( sel₂(x₁, x₂) ) = x₁ + x₂ + 2

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib₁(X)) -> PROPER₁(X)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(s₁(X)) -> PROPER₁(X)

The remaining pairs can at least be oriented weakly.

PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib₁(X)) -> PROPER₁(X)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( s₁(x₁) ) = x₁ + 3

POL( sel₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( fib₁(x₁) ) = x₁

POL( fib1₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( cons₂(x₁, x₂) ) = x₁ + x₂ + 2

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib₁(X)) -> PROPER₁(X)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)

The remaining pairs can at least be oriented weakly.

PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib₁(X)) -> PROPER₁(X)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( cons₂(x₁, x₂) ) = x₁ + x₂ + 3

POL( fib1₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( fib₁(x₁) ) = x₁

POL( sel₂(x₁, x₂) ) = x₁ + x₂ + 2

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib₁(X)) -> PROPER₁(X)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)

The remaining pairs can at least be oriented weakly.

PROPER₁(fib₁(X)) -> PROPER₁(X)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( sel₂(x₁, x₂) ) = x₁ + x₂ + 3

POL( fib₁(x₁) ) = x₁

POL( fib1₂(x₁, x₂) ) = x₁ + x₂ + 2

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib₁(X)) -> PROPER₁(X)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(fib1₂(X1, X2)) -> PROPER₁(X2)

The remaining pairs can at least be oriented weakly.

PROPER₁(fib₁(X)) -> PROPER₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( fib1₂(x₁, x₂) ) = x₁ + x₂ + 3

POL( fib₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(fib₁(X)) -> PROPER₁(X)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(fib₁(X)) -> PROPER₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( PROPER₁(x₁) ) = max{0, x₁ - 2}

POL( fib₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(fib1₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(fib1₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(fib₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(fib1₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(fib1₂(X1, X2)) -> ACTIVE₁(X2)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(fib₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( fib1₂(x₁, x₂) ) = x₁ + x₂ + 3

POL( sel₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( cons₂(x₁, x₂) ) = x₁

POL( add₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( fib₁(x₁) ) = x₁

POL( s₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(fib₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(fib₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( sel₂(x₁, x₂) ) = x₁ + x₂ + 3

POL( cons₂(x₁, x₂) ) = x₁

POL( add₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( fib₁(x₁) ) = x₁

POL( s₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(fib₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(fib₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X2)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( cons₂(x₁, x₂) ) = x₁ + 3

POL( add₂(x₁, x₂) ) = x₁ + x₂ + 2

POL( fib₁(x₁) ) = x₁

POL( s₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(fib₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X2)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(add₂(X1, X2)) -> ACTIVE₁(X2)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(fib₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( add₂(x₁, x₂) ) = x₁ + x₂ + 3

POL( fib₁(x₁) ) = x₁

POL( s₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(fib₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(fib₁(X)) -> ACTIVE₁(X)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(s₁(X)) -> ACTIVE₁(X)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( fib₁(x₁) ) = x₁ + 3

POL( s₁(x₁) ) = x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(s₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(s₁(X)) -> ACTIVE₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ACTIVE₁(x₁) ) = max{0, x₁ - 2}

POL( s₁(x₁) ) = x₁ + 3

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TOP₁(ok₁(X)) -> TOP₁(active₁(X))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))

The TRS R consists of the following rules:

active₁(fib₁(N)) -> mark₁(sel₂(N, fib1₂(s₁(0), s₁(0))))
active₁(fib1₂(X, Y)) -> mark₁(cons₂(X, fib1₂(Y, add₂(X, Y))))
active₁(add₂(0, X)) -> mark₁(X)
active₁(add₂(s₁(X), Y)) -> mark₁(s₁(add₂(X, Y)))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(fib₁(X)) -> fib₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(fib1₂(X1, X2)) -> fib1₂(active₁(X1), X2)
active₁(fib1₂(X1, X2)) -> fib1₂(X1, active₁(X2))
active₁(s₁(X)) -> s₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(active₁(X1), X2)
active₁(add₂(X1, X2)) -> add₂(X1, active₁(X2))
fib₁(mark₁(X)) -> mark₁(fib₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
fib1₂(mark₁(X1), X2) -> mark₁(fib1₂(X1, X2))
fib1₂(X1, mark₁(X2)) -> mark₁(fib1₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
add₂(mark₁(X1), X2) -> mark₁(add₂(X1, X2))
add₂(X1, mark₁(X2)) -> mark₁(add₂(X1, X2))
proper₁(fib₁(X)) -> fib₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(fib1₂(X1, X2)) -> fib1₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(0) -> ok₁(0)
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(add₂(X1, X2)) -> add₂(proper₁(X1), proper₁(X2))
fib₁(ok₁(X)) -> ok₁(fib₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
fib1₂(ok₁(X1), ok₁(X2)) -> ok₁(fib1₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
add₂(ok₁(X1), ok₁(X2)) -> ok₁(add₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.